Massively Parallel Genetic Optimization Through Asynchronous Propagation of Populations

نویسندگان

چکیده

We present Propulate, an evolutionary optimization algorithm and software package for global in particular hyperparameter search. For efficient use of HPC resources, Propulate omits the synchronization after each generation as done conventional genetic algorithms. Instead, it steers search with complete population at time breeding new individuals. provide MPI-based implementation our algorithm, which features variants selection, mutation, crossover, migration is easy to extend custom functionality. compare established tool Optuna. find that up three orders magnitude faster without sacrificing solution accuracy, demonstrating efficiency efficacy lazy approach. Code documentation are available https://github.com/Helmholtz-AI-Energy/propulate

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A massively asynchronous, parallel brain

Whether the visual brain uses a parallel or a serial, hierarchical, strategy to process visual signals, the end result appears to be that different attributes of the visual scene are perceived asynchronously--with colour leading form (orientation) by 40 ms and direction of motion by about 80 ms. Whatever the neural root of this asynchrony, it creates a problem that has not been properly address...

متن کامل

Massively Parallel Genetic Algorithms

Heuristic algorithms are usually employed to find an optimal solution to NP-Complete problems. Genetic algorithms are among such algorithms and they are search algorithms based on the mechanics of natural selection and genetics. Since genetic algorithms work with a set of candidate solutions, parallelisation based on the SIMD paradigm seems to be the natural way to obtain a speed up. In this ap...

متن کامل

Massively Parallel Genetic Algorithms

The genetic algorithm is an iterative random search technique for nonlinear or combi-natorial problems. In this contribution, rst the development from the classical genetic algorithm (GA) via the parallel genetic algorithm (PGA) to the massively parallel genetic algorithm (MPGA) is described. Then experimental results with an implementation of the MPGA on the array processor MasPar MP-1 are dis...

متن کامل

Parallel asynchronous particle swarm optimization.

The high computational cost of complex engineering optimization problems has motivated the development of parallel optimization algorithms. A recent example is the parallel particle swarm optimization (PSO) algorithm, which is valuable due to its global search capabilities. Unfortunately, because existing parallel implementations are synchronous (PSPSO), they do not make efficient use of comput...

متن کامل

Massively parallel programming in statistical optimization & simulation

General purpose graphics processing units (GPGPUs) suitable for general purpose programming have become sufficiently affordable in the last three years to be used in personal workstations. In this paper we assess the usefulness of such hardware in the statistical analysis of simulation input and output data. In particular we consider the fitting of complex parametric statistical metamodels to l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-32041-5_6